Processing math: 100%

The Four Lemma and Five Lemma

The four lemma and five lemma are similar to the snake lemma in the sense that they relate information between two exact sequences. However, these lemmas say something about the maps connecting the two sequences such as injectivity, surjectivity, or even when a map is an isomorphism. Most of the time these lemmas are used when the modules on the far left or far right in each sequence are both zero and the map connecting them is the identity map so as to trivially satisfy the assumptions.

Lemma 1. (Four Lemma)
  1. Suppose that one has the following commutative diagram with exact rows: AφBψCσDαβγδAφBψCσD If β and δ are injective and α is surjective, then γ is injective.

  2. Suppose that one has the following commutative diagram with exact rows: BψCσDτEβγδεBψCσDτE If β and δ are surjective and ε is injective, then γ is surjective.
Proof:
  1. In order to show that γ is injective, we will show that kerγ=0. Let xC be an element so that γ(x)=0. Then certainly the composition σ(γ(x))=0. However, by the commutativity of the diagram, δ(σ(x))=σ(γ(x))=0. However, δ is injective so it must be that σ(x)=0. Hence xkerσ=imψ by exactness, so there exists an element yB so that ψ(y)=x. Now by commutativity of the diagram, we observe that ψ(β(y))=γ(ψ(y))=γ(x)=0. Hence β(y)kerψ=imφ, so there exists an element zA so that φ(z)=β(y). Now since α is surjective, there exists an element aA so that α(a)=z. Then by commutativity, we have that β(φ(a))=φ(α(a))=φ(z)=β(y) However, β is injective so it must be that y=φ(a). Finally, we see that x=ψ(y)=ψ(φ(a))=0 due to exactness since ψφ=0. Hence x=0 so we conclude that kerγ=0 so γ is indeed injective.

  2. Let xC be any element. Then since δ is a surjective map, there exists an element yD so that δ(y)=σ(x). By commutativity, τ(δ(y))=ε(τ(y)). Now since δ(y)=σ(x) and exactness, we observe that ε(τ(y))=τ(δ(y))=τ(σ(x))=0 since τσ=0. Hence τ(y)kerε=0 since ε is injective. Hence τ(y)=0 so ykerτ=imσ so there exists an element zC so that σ(z)=y. Then by the commutativity of the diagram, we have that σ(γ(z))=δ(σ(z))=δ(y)=σ(x). Now by linearity, we see that σ(xγ(z))=0. Hence xγ(z)kerσ=imψ, hence there exists an element wB so that ψ(w)=xγ(z). Now as β is surjective, there exists an element bB so that β(b)=w. Then by commutativity, γ(ψ(b))=ψ(β(b))=ψ(w)=xγ(z) Now by linearity, we see that x=γ(ψ(b))+γ(z)=γ(ψ(b)+z). Hence ximγ so we conclude that γ is surjective.

Lemma 2. (Five Lemma)
Suppose that one has the following commutative diagram with exact rows: AφBψCσDτEαβγδεAφBψCσDτE If β and δ are isomorphisms, α is surjective, and ε is injective, then γ is an isomorphism.

Proof: This follows easily from the two statements of the four-lemma as one can decompose the diagram into AφBψCσDBψCσDτEαβγδβγδεAφBψCσDandBψCσDτE Now one simply uses both parts of the four lemma to conclude that γ is both injective and surjective, hence an isomorphism.